Complexity classes - PDFSEARCH.IO - Document Search Engine

Complexity classes
Results: 1120

#	Item
61	Efficient Secure Computation Optimization Raphael Urmoneit Florian Kerschbaum Technische Universität Add to Reading List Source URL: www.fkerschbaum.org Language: English - Date: 2013-08-28 05:10:42 Complexity classes Theoretical computer science Computational resources Mathematical logic Computability theory Algorithm Recursion NP DSPACE FO Exponential time hypothesis Time complexity
62	CONSTRAINT SATISFACTION WITH COUNTING QUANTIFIERS BARNABY MARTIN ∗† , FLORENT MADELAINE Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2015-03-30 10:49:56 Complexity classes IP FO PSPACE-complete PSPACE Interpretation NP Quantifier Well-formed formula Generalized geography Linear temporal logic
63	Reuse It Or Lose It: More Efficient Secure Computation Through Reuse of Encrypted Values Benjamin Mood Yale University Add to Reading List Source URL: www.cs.yale.edu Language: English - Date: 2014-08-25 10:31:08 Circuit complexity Complexity classes Secure multi-party computation Computational complexity theory Digital circuits Circuit Boolean circuit CC Hash function NC
64	Introduction & Motivation Relations and Operations The complexity of positive equality-free first-order logic II: the four-element case Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2010-08-24 16:58:08 Complexity classes Finite model theory Computational complexity theory Descriptive complexity Structural complexity theory FO SO P versus NP problem NP P Reduction HO
65	On the Complexity of Computing Units in a Number Field V. Arvind and Piyush P Kurur Institute of Mathematical Sciences C.I.T Campus,Chennai, India {arvind,ppk}@imsc.res.in Add to Reading List Source URL: www.cse.iitk.ac.in Language: English - Date: 2016-07-30 09:35:21 Complexity classes Algebraic number theory Polynomials Circuit complexity NC NP Lattice Algebraic number field Jordan normal form Discriminant of an algebraic number field
66	CS369E: Communication Complexity (for Algorithm Designers) Lecture #7: Lower Bounds in Algorithmic Game Theory∗ Tim Roughgarden† March 5, 2015 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2015-09-14 17:18:05 Game theory Computational complexity theory Quantum complexity theory Complexity classes Decision theory Nash equilibrium Price of anarchy Exponential time hypothesis Circuit complexity Communication complexity Algorithmic game theory PP
67	Introduction & Motivation Relations and Operations The complexity of positive equality-free first-order logic Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2010-09-09 14:15:56 Complexity classes Finite model theory Computational complexity theory Descriptive complexity FO Constraint programming Constraint satisfaction problem P Model theory Mathematical logic Constraint satisfaction HO
68	PDF Document Add to Reading List Source URL: www.ma.huji.ac.il Language: English - Date: 2013-01-02 04:40:23 Model theory Mathematical structures Mathematical logic Complexity classes Computability theory Equivalence relation Structure FO Metric space Arithmetical hierarchy Definable set Mutation
69	Low-end uniform hardness vs. randomness tradeoffs for AM Christopher Umans† Department of Computer Science California Institute of Technology Pasadena, CA 91125. Add to Reading List Source URL: users.cms.caltech.edu Language: English - Date: 2008-05-08 17:50:59 Complexity classes Computational complexity theory Advice PP P/poly ArthurMerlin protocol Pseudorandom generator Randomized algorithm NP IP Extractor ACC0
70	Homework #12 Ling201, Apr. 26 Due Date: Tuesday 5/3, at the beginning of class. Absolutely NO LATE WORK accepted! Add to Reading List Source URL: people.umass.edu Language: English - Date: 2011-04-26 23:54:05 Complexity classes Syntactic categories Syntax Phrase structure rules Phrase NP